FPGA controller for rearrangeable Log2(N, 0, p) fabrics with an even number of stages
نویسندگان
چکیده
منابع مشابه
Wide-Sense Nonblocking Multiplane Baseline Switching Networks Composed of d d Switches
A new control algorithm for log2(N, 0, p) switching networks composed of 2 × 2 switching elements has been proposed recently. Under this algorithm, log2(N, 0, p) switching networks with even number of stages are wide-sense nonblocking (WSNB) if p is the same as for the rearrangeable nonblocking (RNB) one. In this paper we extend this solution to logd(N, 0, p) switching networks. The control alg...
متن کاملRearranging Algorithms for Log 2 ( N , 0 , p ) Switching Networks with Even Number of Stages
In this paper we consider the rearrangeable multi-plane banyan-type switching fabrics, called also log, (N, 0, p) switching networks, with even number of stages. For such networks different rearranging algorithms have been proposed for both: one-at-a-time and simultaneous connection models. In this paper we consider the oneat-a-time connection model, where connections arrive to the system one-b...
متن کاملRearrangeable f-cast multi-log2 N networks
Multi-log2 N networks (or vertically stacked banyan networks) have been an attractive class of switching networks due to their small depth O(log N), absolute signal loss uniformity and good fault tolerance property. Recently, F.K.Hwang extended the study of multi-log2 N networks to the generalf -cast case, which covers the unicast case (f = 1) and multicast case (f = N) as special cases, and de...
متن کاملAn Efficient LUT Design on FPGA for Memory-Based Multiplication
An efficient Lookup Table (LUT) design for memory-based multiplier is proposed. This multiplier can be preferred in DSP computation where one of the inputs, which is filter coefficient to the multiplier, is fixed. In this design, all possible product terms of input multiplicand with the fixed coefficient are stored directly in memory. In contrast to an earlier proposition Odd Multiple Storage ...
متن کاملCongruences of Concave Composition Functions
Concave compositions are ordered partitions whose parts are decreasing towards a central part. We study the distribution modulo a of the number of concave compositions. Let c(n) be the number of concave compositions of n having even length. It is easy to see that c(n) is even for all n 1. Refining this fact, we prove that #{n < X : c(n) ⌘ 0 (mod 4)} p X and also that for every a > 2 and at leas...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011